package com.yun.algorithmproblem.leetcodenotcomplete;

import java.util.HashSet;

public class Leetcode2094 {

    public int[] findEvenNumbers(int[] digits) {
        HashSet<Integer> set = new HashSet<>();
        int p = 0, q = 0, count = 0, num = 0;
        for (int i = 0; i < digits.length; i++) {
            //只有满队列才删除队列最前面的元素
            if (q - p > 2) {
                count &= ~(1 << digits[p++]);
            }
            //试图向队列里面添加元素
            while (((count >> digits[i]) & 1) != 1) {
                count &= ~(1 << digits[p++]);
            }
            count |= 1 << digits[i];
            if (q - p == 3) {

            }
        }
        return null;
    }
}
